|
In number theory, a Sierpinski or Sierpiński number is an odd natural number ''k'' such that is composite, for all natural numbers ''n''. In 1960, Wacław Sierpiński proved that there are infinitely many odd integers ''k'' which have this property. In other words, when ''k'' is a Sierpiński number, all members of the following set are composite: : Numbers in such a set with odd ''k'' and are Proth numbers. ==Known Sierpiński numbers== The sequence of currently ''known'' Sierpiński numbers begins with: : 78557, 271129, 271577, 322523, 327739, 482719, 575041, 603713, 903983, 934909, 965431, … . The number 78557 was proved to be a Sierpiński number by John Selfridge in 1962, who showed that all numbers of the form have a factor in the covering set For another known Sierpiński number, 271129, the covering set is All currently known Sierpiński numbers possess similar covering sets.〔(Sierpinski number at The Prime Glossary )〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Sierpinski number」の詳細全文を読む スポンサード リンク
|